Simulation-based Synthesis of Composite Dispatching Rules

ثبت نشده
چکیده

This paper describes the simulation-based synthesis of optimum dispatching rules for the wafer test area of a semiconductor production plant. The target of the optimisation task is the minimum average lead time under the constraint of maintaining on-time delivery. Dispatching is a very fast and robust technique for sequence-planning even when cycle times are not perfectly controlled. A broad range of standard dispatching rules can be found in the literature, each with its own strengths and weaknesses. Less information is available on the use of combinations of these rules. An analysis of the properties that influence the lead times and delivery dates of the lots in the facility shows that composite dispatching rules need to be used to meet the specified target. In this paper we describe how simulation is used to explore the design space of composite dispatching rules. Based on a simulation model of the entire wafer test area, we have tested various combinations of dispatching rules under realistic operating conditions. The optimum rule combination thus found leads to an average lead time reduction of 15% while maintaining, or improving, on-time delivery.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

متن کامل

Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems

We solve the multi-objective flexible job-shop problems by using dispatching rules discovered through genetic programming. While Simple Priority Rules have been widely applied in practice, their efficacy remains poor due to lack of a global view. Composite dispatching rules have been shown to be more effective as they are constructed through human experience. In this paper, we evaluate and empl...

متن کامل

Designing Dispatching Rules to Minimize Total Tardiness

We approximate optimal solutions to the Flexible Job-Shop Problem by using dispatching rules discovered through Genetic Programming. While Simple Priority Rules have been widely applied in practice, their efficacy remains poor due to lack of a global view. Composite Dispatching Rules have been shown to be more effective as they are constructed through human experience. In this work, we employ s...

متن کامل

The performance of load-selection rules and pickup-dispatching rules for multiple-load AGVs

In this paper, we address the problem of load selection and pickup-dispatching of multiple-load AGVs. Various load-selection rules and pickup-dispatching rules are proposed and studied. The objective of this study is twofold. We want to understand not only the performance of load-selection rules and pickup-dispatching rules in two performance criteria—throughput and tardiness, but also the effe...

متن کامل

Dynamic Scheduling of a Semiconductor Production Line Based on a Composite Rule Set

Various factors and constraints should be considered when developing a manufacturing production schedule, and such a schedule is often based on rules. This paper develops a composite dispatching rule based on heuristic rules that comprehensively consider various factors in a semiconductor production line. The composite rule is obtained by exploring various states of a semiconductor production l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004